Assessing Congruence Among Ultrametric Distance Matrices

نویسندگان

  • Véronique Campbell
  • Pierre Legendre
  • François-Joseph Lapointe
چکیده

Recently, a test of congruence among distance matrices (CADM) has been developed. The null hypothesis is the incongruence among all data matrices. It has been shown that CADM has a correct type I error rate and good power when applied to independently-generated distance matrices. In this study, we investigate the suitability of CADM to compare ultrametric distance matrices. We tested the type I error rate and power of CADM with randomly generated dendrograms and their associated ultrametric distance matrices. We show that the test has correct type I error rates and good power. To obtain the significance level of the statistic, a single (as in the Mantel test) or a double (as in the double permutation test, DPT) permutation procedure was used. The power of CADM remained identical when the two permutation methods were compared. This study clearly demonstrates that CADM can be used to determine whether different dendrograms convey congruent information.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating Phylogenies from Lacunose Distance Matrices: Additive is Superior to Ultrametric Estimation

Lapointe and Kirsch (1995) have recently explored the possibility of reconstructing phylogenetic trees from lacunose distance matrices. They have shown that missing cells can be estimated using the ultrametric property of distances, and that reliable trees can be derived from such filled matrices. Here, we extend their work by introducing a novel way to estimate distances based on the four-poin...

متن کامل

Ultrametric sets in Euclidean point spaces

Finite sets S of points in a Euclidean space the mutual distances of which satisfy the ultrametric inequality (A;B) maxf (A;C); (C;B)g for all points in S are investigated and geometrically characterized. Inspired by results on ultrametric matrices and previous results on simplices, connections with so-called centered metric trees as well as with strongly isosceles right simplices are found. AM...

متن کامل

Title : A weighted least - squares approach for inferring phylogenies from incomplete distance matrices

Motivation: The problem of phylogenetic inference from data sets including incomplete or uncertain entries is among the most relevant issues in systematic biology. In this paper, we propose a new method for reconstructing phylogenetic trees from partial distance matrices. The new method combines the usage of the four-point condition and the ultrametric inequality with a weighted least-squares a...

متن کامل

A weighted least-squares approach for inferring phylogenies from incomplete distance matrices

MOTIVATION The problem of phylogenetic inference from datasets including incomplete or uncertain entries is among the most relevant issues in systematic biology. In this paper, we propose a new method for reconstructing phylogenetic trees from partial distance matrices. The new method combines the usage of the four-point condition and the ultrametric inequality with a weighted least-squares app...

متن کامل

Replica Fourier Transforms on ultrametric trees , and block - diagonalizing multi - replica matrices

The analysis of objects living on ultrametric trees, in particular the block-diagonalization of 4?replica matrices M ; , is shown to be dramatically simpliied through the introduction of properly chosen operations on those objects. These are the Replica Fourier Transforms on ultrametric trees. Those transformations are deened and used in the present work.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Classification

دوره 26  شماره 

صفحات  -

تاریخ انتشار 2009